Proof complexity of intuitionistic implicational formulas
نویسندگان
چکیده
منابع مشابه
Proof complexity of intuitionistic implicational formulas
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF ) or substitution Frege (SF ) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC p...
متن کاملUnique Normal Proof Property for Implicational Minimal Formulas in the Intuitionistic Logic
A formula is said to have unique-normal proof property and unique-normal proof property ii it has a unique-normal proof and a-normal proof in NJ, respectively. In this report a condition of implicational minimal formulas in the intuitionistic logic for unique-normal proof property is presented making use of unique-normal proof property for negatively non-duplicated formulas. It is shown that th...
متن کاملProof Complexity of Intuitionistic Propositional Logic
We explore the proof complexity of intuitionistic propositional logic (IPL). The problem of determining whether or not an intuitionistic formula is valid is PSPACE-Complete via a reduction from QBF . In view of this reduction (due to Statman), it is natural to compare the proof-theoretic strength of a standard axiomatic system for IPL with a similar proof system for classical quantified Boolean...
متن کاملApplications of positive and intuitionistic bounded arithmetic to proof complexity
We introduce uniform versions of monotone and deep inference proof systems in the setting of bounded arithmetic, relating the size of propositional proofs to forms of proof-theoretic strength in weak fragments of arithmetic. This continues the recent program of studying the complexity of propositional deep inference. In particular this work is inspired by previous work where proofs of the propo...
متن کاملUniqueness of Normal Proofs in Implicational Intuitionistic Logic
A minimal theorem in a logic L is an L-theorem which is not a nontrivial substitution instance of another L-theorem. Komori (1987) raised the question whether every minimal impli-cational theorem in intuitionistic logic has a unique normal proof in the natural deduction system NJ. The answer has been known to be partially positive and generally negative. It is shown here that a minimal implicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2017
ISSN: 0168-0072
DOI: 10.1016/j.apal.2016.09.003